A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars
نویسندگان
چکیده
منابع مشابه
A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars
This paper solves a natural but still open question: can Abstract Categorial Grammars (ACGs) respresent usual categorial grammars? Despite their name and their claim to be a unifying framework, up to now there was no faithful representation of usual categorial grammars in ACGs. This paper shows that Non-Associative Lambek grammars as well as their derivations can be defined using ACGs of order ...
متن کاملExtending Lambek Grammars to Basic Categorial Grammars
Pentus [24] proves the equivalence of LCG’s and CFG’s, and CFG’s are equivalent to BCG’s by the Gaifman theorem [1]. This paper provides a procedure to extend any LCG to an equivalent BCG by affixing new types to the lexicon; a procedure of that kind was proposed as early, as Cohen [12], but it was deficient [4]. We use a modification of Pentus’ proof and a new proof of the Gaifman theorem on t...
متن کاملLambek Grammars as Combinatory Categorial Grammars
We propose a combinatory reformulation of the product free version of the categorial calculus LL, i.e. the associative Lambek calculus that admits empty premises. We prove equivalence of the combinatory with the standard Natural Deduction presentation of LL. The result offers a new perspective on the relation between the type logical and the combinatory branch of the Categorial Grammar research...
متن کاملConjoinability and unification in Lambek categorial grammars
Recently, learning algorithms in Gold’s model have been proposed for some particular classes of classical categorial grammars [Kan98]. We are interested here in learning Lambek categorial grammars. In general grammatical inference uses unification and substitution. In the context of Lambek categorial grammars it seems appropriate to incorporate an operation on types based both on deduction (Lam...
متن کاملTowards Abstract Categorial Grammars
We introduce a new categorial formalism based on intuitionistic linear logic. This formalism, which derives from current type-logical grammars, is abstract in the sense that both syntax and semantics are handled by the same set of primitives. As a consequence, the formalism is reversible and provides different computational paradigms that may be freely composed together.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic, Language and Information
سال: 2010
ISSN: 0925-8531,1572-9583
DOI: 10.1007/s10849-009-9111-z